منابع مشابه
Order-incompleteness and finite lambda reduction models
Many familiar models of the untyped lambda calculus are constructed by order theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory of βor βη-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the untyped lamb...
متن کاملConservative model reduction for finite-volume models
This work proposes a method for model reduction of finite-volume models that guarantees the resulting reduced-order model is conservative, thereby preserving the structure intrinsic to finite-volume discretizations. The proposed reduced-order models associate with optimization problems characterized by a minimum-residual objective function and nonlinear equality constraints that explicitly enfo...
متن کاملA finite time stochastic clustering algorithm
We present a finite time local search (1 + δ)-approximation method finding the optimal solution with probability almost one with respect to a general measure of within group-dissimilarity. The algorithm is based on a finite-time Markov model of the simulated annealing. A dynamic cooling schedule, allows the control of the convergence. The algorithm uses as measure of within group dissimilarity ...
متن کاملPerturbed discrete time stochastic models
In this thesis, nonlinearly perturbed stochastic models in discrete time are considered. We give algorithms for construction of asymptotic expansions with respect to the perturbation parameter for various quantities of interest. In particular, asymptotic expansions are given for solutions of renewal equations, quasi-stationary distributions for semi-Markov processes, and ruin probabilities for ...
متن کاملTime Reduction of Stochastic Parsing with Stochastic Context-Free Grammars
This paper proposes an approach to reduce the stochastic parsing time with stochastic context-free grammars. The basic idea consists of storing a set of precomputed problems. These precomputed problems are obtained off line from a training corpus or they are computed on line from a test corpus. In this work, experiments with the UPenn Treebank are reported in order to show the performance of bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2005
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.1990108